# ---
# title: 459. Repeated Substring Pattern
# id: problem459
# author: Indigo
# date: 2021-02-04
# difficulty: Easy
# categories: String
# link: <https://leetcode.com/problems/repeated-substring-pattern/description/>
# hidden: true
# ---
# 
# Given a non-empty string check if it can be constructed by taking a substring
# of it and appending multiple copies of the substring together. You may assume
# the given string consists of lowercase English letters only and its length
# will not exceed 10000.
# 
# 
# 
# **Example 1:**
# 
#     
#     
#     Input: "abab"
#     Output: True
#     Explanation: It's the substring "ab" twice.
#     
# 
# **Example 2:**
# 
#     
#     
#     Input: "aba"
#     Output: False
#     
# 
# **Example 3:**
# 
#     
#     
#     Input: "abcabcabcabc"
#     Output: True
#     Explanation: It's the substring "abc" four times. (And the substring "abcabc" twice.)
#     
# 
# 
## @lc code=start
using LeetCode

function repeated_substring_pattern(s::String)
    findnext(s, s^2, 2) != length(s) + 1 : 2 * length(s)
end
## @lc code=end
